Limiting behaviour of linear cellular automata

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Cellular Automata

6 The calculus of regular expressions 75 6.1 Derivatives

متن کامل

Quasi-Linear Cellular Automata

Simulating a cellular automaton (CA) for t time-steps into the future requires t serial computation steps or t parallel ones. However, certain CAs based on an Abelian group, such as addition mod 2, are termed linear because they obey a principle of superposition. This allows them to be predicted efficiently, in serial time O(t) or O(log t) in parallel. In this paper, we generalize this by looki...

متن کامل

Linear Cellular Automata and Finite Automata

Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs, construed as semiautomata, provide a natural setting for the study of cellular automata. For example, we give a simple algorithm to determine reversibility and surjectivity of the global maps. We also comment on Wolfram’s question about the growth rates of the minimal f...

متن کامل

Linear Cellular Automata and de Bruijn Automata

Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs, construed as semiau-tomata, provide a natural setting for the study of cellular automata. For example, we give a simple algorithm to determine reversibility and surjectivity of the global maps. We also comment on Wolfram's question about the growth rates of the minimal ...

متن کامل

Linear Cellular Automata and Fischer Automata

We study the sizes of minimal finite state machines associated with linear cellular automata. In particular, we construct a class of binary linear cellular automata whose corresponding minimal automata exhibit full exponential blow-up. These cellular automata have Hamming distance 1 to a permutation automaton. Moreover, the corresponding minimal Fischer automata as well as the minimal DFAs have...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences

سال: 1987

ISSN: 0386-2194

DOI: 10.3792/pjaa.63.182